Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
(x . y) . z |
→ x . (y . z) |
|
There are 2 dependency pairs:
|
| 2: |
|
(x . y) .# z |
→ x .# (y . z) |
| 3: |
|
(x . y) .# z |
→ y .# z |
|
Consider the SCC {2,3}.
By taking the AF π with
π(.#) = 1 together with
the lexicographic path order with
empty precedence,
the rules in {1-3}
are strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006